Published in: LIPIcs, Volume 289, 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)
C. Aiswarya, Soumodev Mal, and Prakash Saivasan. Satisfiability of Context-Free String Constraints with Subword-Ordering and Transducers. In 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 289, pp. 5:1-5:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{aiswarya_et_al:LIPIcs.STACS.2024.5, author = {Aiswarya, C. and Mal, Soumodev and Saivasan, Prakash}, title = {{Satisfiability of Context-Free String Constraints with Subword-Ordering and Transducers}}, booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)}, pages = {5:1--5:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-311-9}, ISSN = {1868-8969}, year = {2024}, volume = {289}, editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.5}, URN = {urn:nbn:de:0030-drops-197154}, doi = {10.4230/LIPIcs.STACS.2024.5}, annote = {Keywords: satisfiability, subword, string constraints, context-free, transducers} }
Published in: LIPIcs, Volume 182, 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020)
C. Aiswarya and Paul Gastin. Weighted Tiling Systems for Graphs: Evaluation Complexity. In 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 182, pp. 34:1-34:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{aiswarya_et_al:LIPIcs.FSTTCS.2020.34, author = {Aiswarya, C. and Gastin, Paul}, title = {{Weighted Tiling Systems for Graphs: Evaluation Complexity}}, booktitle = {40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020)}, pages = {34:1--34:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-174-0}, ISSN = {1868-8969}, year = {2020}, volume = {182}, editor = {Saxena, Nitin and Simon, Sunil}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2020.34}, URN = {urn:nbn:de:0030-drops-132753}, doi = {10.4230/LIPIcs.FSTTCS.2020.34}, annote = {Keywords: Weighted graph tiling, tiling automata, Evaluation, Complexity, Tree-width} }
Published in: LIPIcs, Volume 85, 28th International Conference on Concurrency Theory (CONCUR 2017)
Parosh Aziz Abdulla, C. Aiswarya, and Mohamed Faouzi Atig. Data Multi-Pushdown Automata. In 28th International Conference on Concurrency Theory (CONCUR 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 85, pp. 38:1-38:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{abdulla_et_al:LIPIcs.CONCUR.2017.38, author = {Abdulla, Parosh Aziz and Aiswarya, C. and Atig, Mohamed Faouzi}, title = {{Data Multi-Pushdown Automata}}, booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)}, pages = {38:1--38:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-048-4}, ISSN = {1868-8969}, year = {2017}, volume = {85}, editor = {Meyer, Roland and Nestmann, Uwe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.38}, URN = {urn:nbn:de:0030-drops-78049}, doi = {10.4230/LIPIcs.CONCUR.2017.38}, annote = {Keywords: Pushdown Systems, Model-Checking, Gap-Order, Bounded Split-Width} }
Published in: LIPIcs, Volume 42, 26th International Conference on Concurrency Theory (CONCUR 2015)
Cyriac Aiswarya, Benedikt Bollig, and Paul Gastin. An Automata-Theoretic Approach to the Verification of Distributed Algorithms. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 340-353, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{aiswarya_et_al:LIPIcs.CONCUR.2015.340, author = {Aiswarya, Cyriac and Bollig, Benedikt and Gastin, Paul}, title = {{An Automata-Theoretic Approach to the Verification of Distributed Algorithms}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {340--353}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.340}, URN = {urn:nbn:de:0030-drops-53737}, doi = {10.4230/LIPIcs.CONCUR.2015.340}, annote = {Keywords: distributed algorithms, verification, leader election} }
Feedback for Dagstuhl Publishing